package leetcode.editor.cn;

public class _72_EditDistance {
    public static void main(String[] args) {
        Solution solution = new _72_EditDistance().new Solution();
        int i = solution.minDistance("horse", "ros");
        System.out.println(i);
    }

    //leetcode submit region begin(Prohibit modification and deletion)
    class Solution {
        public int minDistance(String word1, String word2) {
            int n1 = word1.length(), n2 = word2.length();
            int[][] dp = new int[n1 + 1][n2 + 1];
            dp[0][0] = 0;
            for (int i = 1; i <= n1; i++) {
                dp[i][0] = i;
            }
            for (int j = 1; j <= n2; j++) {
                dp[0][j] = j;
            }
            for (int i = 1; i <= n1; i++) {
                for (int j = 1; j <= n2; j++) {
                    if (word1.charAt(i - 1) == word2.charAt(j - 1)) {
                        dp[i][j] = dp[i - 1][j - 1];
                    } else {
                        dp[i][j] = Math.min(dp[i - 1][j - 1], Math.min(dp[i][j - 1], dp[i - 1][j])) + 1;
                    }
                }
            }
            return dp[n1][n2];
        }
    }
//leetcode submit region end(Prohibit modification and deletion)

}